Making Octants Colorful and Related Covering Decomposition Problems
نویسندگان
چکیده
منابع مشابه
Making Octants Colorful and Related Covering Decomposition Problems
We give new positive results on the long-standing open problem of geometric covering decomposition for homothetic polygons. In particular, we prove that for any positive integer k, every finite set of points in R can be colored with k colors so that every translate of the negative octant containing at least k points contains at least one of each color. The best previously known bound was doubly...
متن کاملMaking Triangles Colorful
We prove that for any finite point set P in the plane, a triangle T , and a positive integer k, there exists a coloring of P with k colors such that any homothetic copy of T containing at least 144k8 points of P contains at least one of each color. This is the first polynomial bound for range spaces induced by homothetic polygons. The only previously known bound for this problem applies to the ...
متن کاملRandom Walks in Octants, and Related Structures
A di¤usion walk in Z2 is a (random) walk with unit step vectors !, ", , and #. Particles from di¤erent sources with opposite charges cancel each other when they meet in the lattice. This cancellation principle is applied to enumerate di¤usion walks in shifted half-planes, quadrants, and octants (a 3-D version is also considered). Summing over time we calculate expected numbers of visits and rs...
متن کاملGreedy algorithms for on-line set-covering and related problems
We study the following on-line model for set-covering: elements of a ground set of size n arrive one-by-one and with any such element ci, arrives also the name of some set Si0 containing ci and covering the most of the uncovered ground set-elements (obviously, these elements have not been yet revealed). For this model we analyze a simple greedy algorithm consisting of taking Si0 into the cover,...
متن کاملTree Spanners for Subgraphs and Related Tree Covering Problems
For any fixed parameter k ≥ 1, a tree k–spanner of a graph G is a spanning tree T in G such that the distance between every pair of vertices in T is at most k times their distance in G. In this paper, we generalize on this very restrictive concept, and introduce Steiner tree k–spanners: We are given an input graph consisting of terminals and Steiner vertices, and we are now looking for a tree k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2014
ISSN: 0895-4801,1095-7146
DOI: 10.1137/140955975